Optimal groundness analysis using propositional logic

Relational Groundness Analysis for Logic Programs

One of the most attractive features of logic programs is that arguments may be used bidirectionally, as input or output at run-time. However, the compiler must generate code for various alternatives, hence considerable slowdown of execution. In this paper we provide static analysis for groundness; that is, inference of whether the arguments are instantiated to ground terms through run-time. Tho...

Parameterizing a Groundness Analysis of Logic Programs

We present a parametric groundness analysis whose input and output are parameterized by a set of groundness parameters. The result of the analysis can be instantiated for different uses of the program. It can also be used to derive sufficient conditions for safely removing groundness checks for built-in calls in the program. The parametric groundness analysis is obtained by generalizing a non-p...

A Polymorphic Groundness Analysis of Logic Programs

A polymorphic analysis is an analysis whose input and output contain parameters which serve as placeholders for information that is unknown before analysis but provided after analysis. In this paper, we present a polymorphic groundness analysis that infers parameterised groundness descriptions of the variables of interest at a program point. The polymorphic groundness analysis is designed by re...

Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...

A simple polynomial groundness analysis for logic programs